Open Capacitated ARC routing problem by Hybridized Ant Colony Algorithm

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in given service area at minimal cost distance. main real application the Meter Reader (MRRP). In MRRP problem, each worker electric (or gas) company must visit and read meters to set customers by starting his route from first customer on list finishing with last one. leaves where he wants once all associated have been visited. this paper, metaheuristic called an Hybridized Ant Colony Algorithm (HACA) developed hybridized local search algorithm that involves 2-opt, Swap, Relocate Cross-exchange moves solve Computational results conducted five different sets OCARP-instances showed our proposed HACA has reached good competitive benchmark instances